Queries Routing In Super-Peer-Based System: Simulation and Evaluation
نویسندگان
چکیده
Peer-to-peer (P2P) computing is currently attracting enormous attention. P2P systems have emerged as a popular way to share huge volumes of data. In such systems each peer is a database management system in itself, ex-posing its own schema. A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. In such settings, the main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. In this paper, we propose an architecture based on (super-)peers, and we focus on query routing. Our approach considers that (super-)Peers having similar interests are grouped together for an efficient query routing method. In such groups, called Knowledge-SuperPeers (KSP), super-peers submit queries that are often processed by members of this group. A KSP is a specific super-peer which contains knowledge about: 1. its superpeers and 2. The others super-peers. Knowledge is extracted by using data mining techniques (e.g. decision tree algorithms) starting from queries of peers that transit on the network. The advantage of this distributed knowledge is that, it avoids to making semantic mapping, between heterogeneous data sources owned by (super-)peers, each time the system decides to route query to other (super)peers. The set of KSP improves the robustness in queries routing mechanism and scalability in P2P Network. Compared with a baseline approach, our proposal shows a better performance using a new simulator with respect to important criteria such as response time, precision and
منابع مشابه
Efficient Super-Peer-Based Queries Routing: Simulation and Evaluation
Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of internet traffic. P2P systems have emerged as a popular way to share huge volumes of data. Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of P2P systems called schemabased. In such systems each peer is a database management system in itself, e...
متن کاملP2P Domain Classification using Decision Tree
The increasing interest in Peer-to-Peer systems (such as Gnutella) has inspired many research activities in this area. Although many demonstrations have been performed that show that the performance of a Peer-to-Peer system is highly dependent on the underlying network characteristics, much of the evaluation of Peer-to-Peer proposals has used simplified models that fail to include a detailed mo...
متن کاملP2P Simulator for Queries Routing using Data Mining
Data mining is used to extract hidden information from large databases. In Peer-to-Peer context, a challenging problem is how to find the appropriate Peer to deal with a given query without overly consuming bandwidth. Different methods proposed routing strategies of queries taking into account the P2P network at hand. An unstructured P2P system based on an organization of Peers around Super-Pee...
متن کاملData Mining in P2P Queries Routing Using Decision Trees
Data mining has been used very frequently to extract hidden information from large databases. This paper suggests a new Peer-to-Peer system that uses decision trees to extract Super-Peers that contain peers that are relevant to a given query. This system is an unstructured P2P system based on an organization of peers around super-peers, connected to Meta-super-peer according to their semantic d...
متن کاملSemantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks
Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of peer-to-peer (p2p) systems called schema-based. In such systems each peer is a database management system in itself, exposing its own schema. In such a setting, a main objective is the efficient search across peer databases by processing each incoming query without overl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011